Randomized algorithms

Results: 419



#Item
161Concepts and Algorithms for Polygonal Simplification Jonathan D. Cohen Department of Computer Science, The Johns Hopkins University 1. INTRODUCTION 1.1 Motivation

Concepts and Algorithms for Polygonal Simplification Jonathan D. Cohen Department of Computer Science, The Johns Hopkins University 1. INTRODUCTION 1.1 Motivation

Add to Reading List

Source URL: www.cs.jhu.edu

Language: English - Date: 2000-11-14 11:05:31
162Detecting and Exploiting Near-Sortedness for Efficient Relational Query Evaluation Sagi Ben-Moshe Eldar Fischer

Detecting and Exploiting Near-Sortedness for Efficient Relational Query Evaluation Sagi Ben-Moshe Eldar Fischer

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2011-01-20 12:03:47
16316  CHAPTER 2. LEADER ELECTION of each node has the same structure. We will now show that non-uniform anonymous leader election for synchronous rings is impossible. The idea is that

16 CHAPTER 2. LEADER ELECTION of each node has the same structure. We will now show that non-uniform anonymous leader election for synchronous rings is impossible. The idea is that

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
164Chapter 2  Leader Election 2.1  Anonymous Leader Election

Chapter 2 Leader Election 2.1 Anonymous Leader Election

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
165138  Chapter 13 Wireless Protocols Wireless communication was one of the major success stories of the last decades.

138 Chapter 13 Wireless Protocols Wireless communication was one of the major success stories of the last decades.

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:47
166Algorithms  Lecture 13: Randomized Minimum Cut [Fa’13] Jaques: But, for the seventh cause; how did you find the quarrel on the seventh cause? Touchstone: Upon a lie seven times removed:–bear your body more seeming, A

Algorithms Lecture 13: Randomized Minimum Cut [Fa’13] Jaques: But, for the seventh cause; how did you find the quarrel on the seventh cause? Touchstone: Upon a lie seven times removed:–bear your body more seeming, A

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:02:40
167On the Complexity of Asynchronous Gossip Chryssis Georgiou Seth Gilbert  Dept. of Computer Science,

On the Complexity of Asynchronous Gossip Chryssis Georgiou Seth Gilbert Dept. of Computer Science,

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2008-08-26 04:43:06
168CCCG 2010, Winnipeg MB, August 9–11, 2010  k-Star-shaped Polygons∗ William Evans†  Abstract

CCCG 2010, Winnipeg MB, August 9–11, 2010 k-Star-shaped Polygons∗ William Evans† Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-09-15 10:13:15
169Deterministic Amplification of Space-Bounded Probabilistic Algorithms Ziv Bar-Yossef Department of Electrical Engineering and Computer Science U.C. Berkeley Berkeley, CA 94720

Deterministic Amplification of Space-Bounded Probabilistic Algorithms Ziv Bar-Yossef Department of Electrical Engineering and Computer Science U.C. Berkeley Berkeley, CA 94720

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2014-06-22 06:25:14
170CS 373: Combinatorial Algorithms, Fall 2000 Homework 1 (due September 12, 2000 at midnight) Name: Net ID:

CS 373: Combinatorial Algorithms, Fall 2000 Homework 1 (due September 12, 2000 at midnight) Name: Net ID:

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:48:11